In irp algorithm , routing is based on component from server , which is simple and practical , but cannot adapt dynamic change in distributed system environment Irp算法仅根据服务器提供的路径构件进行寻径,简单实用,但难以适应分布系统环境的动态变化。
In l - s algorithm ( link state algorithm ) , routing is based on table drove , which can adapt dynamic change of distributed system environment and guarantee message routing correctly L - s算法(即链路状态算法)采用表驱动的方式进行消息寻径,能够自主适应分布系统环境的动态变化,保障消息的正确寻径。